Departures from Many Queues in Series
نویسندگان
چکیده
منابع مشابه
Departures from Many Queues in Series
We consider a series of n single-server queues, each with unlimited waiting space and the first-in first-out service discipline. Initially, the system is empty; then k customers are placed in the first queue. The service times of all the customers at all the queues are i.i.d. with a general distribution. We are interested in the time D(k, n) required for all k customers to complete service from...
متن کاملThe asymptotic variance of departures in critically loaded queues
We consider the asymptotic variance of the departure counting processD(t) of the GI/G/1 queue;D(t) denotes the number of departures up to time t. We focus on the case that the system load % equals 1, and prove that the asymptotic variance rate satisfies lim t→∞ VarD(t) t = λ ( 1− 2 π )( ca + c 2 s ) , where λ is the arrival rate and ca, cs are squared coefficients of variation of the inter-arri...
متن کاملArranging Queues in Series
For given external arrival process and given service-time distributions, the object is to determine the order of infinite-capacity single-server queues in series that minimizes the long-run average sojourn time per customer. We gain additional insight into this queueing design problem, and congestion in open queueing networks more generally, primarily by performing simulation experiments. We de...
متن کاملQueues with infinitely many servers
— In the time interval (0, oo) calls arrive in a téléphone exchange in accordance with a récurrent process. There are an unlimited number ofavailable Unes. The holding times are mutually independent and identically distributed positive rondom variables and are independent of the arrivai times. In this paper we détermine the limit distribution of the number of the busy Unes at the arrivai of the...
متن کاملCustomer Abandonment in Many-Server Queues
We study G/G/n+GI queues in which customer patience times are independent, identically distributed following a general distribution. When a customer’s waiting time in queue exceeds his patience time, the customer abandons the system without service. For the performance of such a system, we focus on the abandonment process and the queue-length process. We prove that, under some conditions, a det...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 1991
ISSN: 1050-5164
DOI: 10.1214/aoap/1177005838